Creating Signed Directed Graph Models for Process Plants
نویسندگان
چکیده
منابع مشابه
Signed directed graph based modeling and its validation from process knowledge and process data
This paper is concerned with the fusion of information from process data and process connectivity and its subsequent use in fault diagnosis and process hazard assessment. The Signed Directed Graph (SDG), as a graphical model for capturing process topology and connectivity to show the causal relationships between process variables by material and information paths, has been widely used in root c...
متن کاملDiagnosis of steady-state process behaviour using rules derived from signed directed graph
In this paper, we propose diagnosis of steady-state process behaviour using rules derived from the signed directed graph(SDG) representing the interaction among the process variables. All abnormalities are correlated using backward reasoning through rules to yield a diagnosis. These rules can be added with experimental rules which are obtained from experts on plant operation.
متن کاملThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملSigned directed acyclic graphs for causal inference.
Formal rules governing signed edges on causal directed acyclic graphs are described in this paper and it is shown how these rules can be useful in reasoning about causality. Specifically, the notions of a monotonic effect, a weak monotonic effect and a signed edge are introduced. Results are developed relating these monotonic effects and signed edges to the sign of the causal effect of an inter...
متن کاملSome Finite-Graph Models for Process Algebra
In this paper, we present a number of closely related models of process algebra [2, 3, 4], called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive process graphs. Just as in the standard graph model [I], each guarded recursive specification has exactly one solution in a finite-graph mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial & Engineering Chemistry Research
سال: 2000
ISSN: 0888-5885,1520-5045
DOI: 10.1021/ie990637v